Fully Automated Cyclic Planning for Large-Scale Manufacturing Domains
نویسندگان
چکیده
In domains such as factory assembly, it is necessary to assemble many identical instances of a particular product. While modern planners can generate assembly plans for single instances of a complex product, generating plans to manufacture many instances of a product is beyond the capabilities of standard planners. We propose ACP, a system which, given a model of a single instance of a product, automatically reformulates and solves the problem as a cyclic planning problem. We show that our domain-independent ACP system can successfully generate cyclic plans for problems which are too large to be solved directly using standard plan-
منابع مشابه
Recent Advances and Future Challenges in Automated Manufacturing Planning
The effective planning of a product’s manufacture is critical to both its cost and delivery time. Recognition of this importance has motivated over thirty years of research into automated planning systems and generated a large literature covering many different manufacturing technologies. But complete automation has proved difficult in most manufacturing domains. However, as manufacturing hardw...
متن کاملTowards Supply Chain Planning Integration: Uncertainty Analysis Using Fuzzy Mathematical Programming Approach in a Plastic Forming Company
Affected by globalization and increased complexity, supply chain managers have learned about the importance of Sales and Operations Planning (S&OP). However, in large scale supply chains, S&OP has received little attention, by both academics and practitioners. The purpose of this manuscript is to investigate the advantages of S&OP process using a mathematical modeling approach in a large scale ...
متن کاملProject-oriented Approach to Production Planning and Scheduling in Make-to-order Manufacturing
In this paper, we present a unified framework for production planning and scheduling in make-to-order manufacturing. Both planning and scheduling problems are captured as resource-constrained project scheduling problems. The actual models and solution techniques are different at the two levels. Hence, we also suggest an aggregation method that provides the connection between planning and schedu...
متن کاملOBDD-based Universal Planning: Specifying and Solving Planning Problems for Synchronized Agents in Non-deterministic Domains
Recently model checking representation and search techniques were shown to be eeciently applicable to planning, in particular to non-deterministic planning. Such planning approaches use Ordered Binary Decision Diagrams (obdds) to encode a planning domain as a non-deterministic nite automaton (NFA) and then apply fast algorithms from model checking to search for a solution. obdds can eeectively ...
متن کاملMulti-Axis Planning System (MAPS) for Hybrid Laser Metal Deposition Processes
This paper summarizes the research and development of a Multi-Axis Planning System (MAPS) for hybrid laser metal deposition processes. The project goal is to enable the current direct metal deposition systems to fully control and utilize multi-axis capability to make complex parts. MAPS allows fully automated process planning for multi-axis layered manufacturing to control direct metal depositi...
متن کامل